Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The numerical optimization of practical applications is an issue of growing importance in research and industry. It allows both the exploration of non-trivial configurations differing widely from all known solutions and the step-by-step improvement of existing designs. The purpose of this book is to introduce the state of the art concerning this issue, referred to in the book as CFD-based Optimization (CFD-O). Many complementary applications are presented, so that interested researchers and engineers will get a clear view of the present possibilities for all problems where the numerical optimization process relies on evaluations obtained through Computational Fluid Dynamics.

Engineering. --- Numerical analysis. --- Mathematical optimization. --- Physics. --- Fluids. --- Computational intelligence. --- Fluid mechanics. --- Engineering Fluid Dynamics. --- Fluid- and Aerodynamics. --- Numerical and Computational Physics. --- Computational Intelligence. --- Numeric Computing. --- Optimization. --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Hydromechanics --- Continuum mechanics --- Intelligence, Computational --- Artificial intelligence --- Soft computing --- Hydraulics --- Mechanics --- Physics --- Hydrostatics --- Permeability --- Natural philosophy --- Philosophy, Natural --- Physical sciences --- Dynamics --- Construction --- Industrial arts --- Technology --- Fluid dynamics --- Mathematical models. --- Hydraulic engineering. --- Electronic data processing. --- Numerical and Computational Physics, Simulation. --- Engineering, Hydraulic --- Engineering --- Fluid mechanics --- Shore protection --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Automation

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Multigrid methods are often used for solving partial differential equations. This book introduces and analyzes the multigrid approach. The approach used here applies to both test problems on rectangular grids and to more realistic applications with complicated grids and domains. Key Features of this Second Edition: - Discusses multigrid methods from the domain decomposition viewpoint, thus making the material accessible to beginning undergraduate/graduate students - Uses the semialgebraic multigrid approach to handle complex topics (such as the solution of systems of PDEs) - Provides relevant and insightful exercises at the end of each chapter which help reinforce the material - Uses numerous illustrations and examples to motivate the subject matter - Covers important applications in physics, engineering and computer science Matrix-Based Multigrid can serve as a textbook for courses in numerical linear algebra, numerical methods for PDEs, and computational physics at the advanced undergraduate and graduate levels. Since most of the background material is covered, the only prerequisites are elementary linear algebra and calculus. Excerpts from the reviews of the first edition: "This book contains a wealth of information about using multilevel methods to solve partial differential equations (PDEs). . . A common matrix-based framework for developing these methods is used throughout the book. This approach allows methods to be developed for problems under three very different conditions. . . This book will be insightful for practitioners in the field. . . students will enjoy studying this book to see how the many puzzle pieces of the multigrid landscape fit together." (Loyce Adams, SIAM review, Vol. 47(3), 2005) "The discussion very often includes important applications in physics, engineering, and computer science. The style is clear, the details can be understood without any serious prerequisite. The usage of multigrid method for unstructured grids is exhibited by a well commented C++ program. This way the book is suitable for anyone . . . who needs numerical solution of partial differential equations." (Peter Hajnal, Acta Scientiarum Mathematicarum, Vol. 70, 2004).

Mathematics. --- Numerical analysis. --- Matrix theory. --- Algebra. --- Mathematical analysis. --- Analysis (Mathematics). --- Computer mathematics. --- Computational intelligence. --- Numerical Analysis. --- Analysis. --- Computational Mathematics and Numerical Analysis. --- Numeric Computing. --- Linear and Multilinear Algebras, Matrix Theory. --- Computational Intelligence. --- Intelligence, Computational --- Artificial intelligence --- Soft computing --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- 517.1 Mathematical analysis --- Mathematical analysis --- Mathematics --- Math --- Science --- Differential equations, Partial --- Multigrid methods (Numerical analysis) --- Matrices. --- Numerical solutions. --- Numerical analysis --- Algebra, Matrix --- Cracovians (Mathematics) --- Matrix algebra --- Matrixes (Algebra) --- Algebra, Abstract --- Algebra, Universal --- Global analysis (Mathematics). --- Computer science --- Electronic data processing. --- Engineering. --- Construction --- Industrial arts --- Technology --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Analysis, Global (Mathematics) --- Differential topology --- Functions of complex variables --- Geometry, Algebraic --- Automation

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008. The 20 revised full papers of the APPROX 2008 workshop were carefully reviewed and selected from 42 submissions and focus on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM 2008 is concerned with applications of randomness to computational and combinatorial problems and accounts for 27 revised full papers, also diligently reviewed and selected out of 52 workshop submissions.

Computer science --- Computer algorithms --- Statistical methods --- Computer science. --- Computer programming. --- Computers. --- Algorithms. --- Numerical analysis. --- Computer Science. --- Programming Techniques. --- Theory of Computation. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Numeric Computing. --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Mathematical analysis --- Algorism --- Algebra --- Arithmetic --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Computers --- Electronic computer programming --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Informatics --- Science --- Mathematics. --- Mathematics --- Foundations --- Programming --- Information theory. --- Computer software. --- Computational complexity. --- Electronic data processing. --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Office practice --- Complexity, Computational --- Software, Computer --- Communication theory --- Communication --- Automation --- Computer science—Mathematics. --- Computational complexity --- Combinatorial optimization --- Discrete mathematics. --- Numerical Analysis. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the thoroughly refereed post-conference proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2008, held in Durham, UK, in June/July 2008. The 30 revised full papers presented together with 3 invited paper were carefully reviewed and selected from 76 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, diagram methods, and support of these concepts by suitable implementations.

Computer programming --- Computer algorithms --- Graph theory --- Computer software. --- Computational complexity. --- Electronic data processing. --- Data structures (Computer scienc. --- Computer graphics. --- Algorithms. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Numeric Computing. --- Data Structures. --- Computer Graphics. --- Algorism --- Algebra --- Arithmetic --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer art --- Graphic arts --- Electronic data processing --- Engineering graphics --- Image processing --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Complexity, Computational --- Machine theory --- Software, Computer --- Computer systems --- Foundations --- Digital techniques --- Automation --- Computer science --- Computer science—Mathematics. --- Numerical analysis. --- Data structures (Computer science). --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Mathematical analysis --- Discrete mathematics. --- Artificial intelligence—Data processing. --- Numerical Analysis. --- Data Science. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The use of static analysis techniques to prove the partial correctness of C code has recently attracted much attention due to the high cost of software errors - particularly with respect to security vulnerabilities. However, research into new analysis techniques is often hampered by the technical difficulties of analysing accesses through pointers, pointer arithmetic, coercion between types, integer wrap-around and other low-level behaviour. Axel Simon provides a concise, yet formal description of a value-range analysis that soundly approximates the semantics of C programs using systems of linear inequalities (polyhedra). The analysis is formally specified down to the bit-level while providing a precise approximation of all low-level aspects of C using polyhedral operations and, as such, it provides a basis for implementing new analyses that are aimed at verifying higher-level program properties precisely. One example of such an analysis is the tracking of the NUL position in C string buffers, which is shown as an extension to the basic analysis and which thereby demonstrates the modularity of the approach. While the book focuses on a sound analysis of C, it will be useful to any researcher and student with an interest in static analysis of real-world programming languages. In fact, many concepts presented here carry over to other languages such as Java or assembler, to other applications such as taint analysis, array and shape analysis and possibly even to other approaches such as run-time verification and test data generation.

Computer Science. --- Logics and Meanings of Programs. --- Software Engineering. --- Numeric Computing. --- Computer science. --- Software engineering. --- Logic design. --- Electronic data processing. --- Informatique --- Génie logiciel --- Structure logique --- C (Computer program language). --- Memory management (Computer science). --- C (Computer program language) --- Memory management (Computer science) --- Engineering & Applied Sciences --- Computer Science --- Management of computer memory --- Programming languages (Electronic computers). --- Computer logic. --- Numerical analysis. --- Programming Languages, Compilers, Interpreters. --- Computer storage devices --- Loop tiling (Computer science) --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Computer software engineering --- Engineering --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Informatics --- Science --- Automation --- Mathematical analysis --- Computer science logic --- Logic, Symbolic and mathematical --- Computer languages --- Computer program languages --- Computer programming languages --- Machine language --- Electronic data processing --- Languages, Artificial